Some NP-Complete Problems for Attribute Reduction in Consistent Decision Tables

Over recent years, the research of attribute reduction for general decision systems and, in particular, consistent tables has attracted great attention from computer science community due to emerge big data. It been known that, a table, we can derive polynomial time complexity algorithm finding reduct. In addition, redundant properties also be done time. However, all reduct sets table is problem with exponential complexity. this paper, study certain class sets. make use new concept relative table. We present two NP-complete problems related proposed concept. These are cardinality constraint and set. On basis result, show that smallest cannot by an